Observational Equivalence Using Schedulers for Quantum Processes

نویسندگان

  • Kazuya Yasuda
  • Takahiro Kubota
  • Yoshihiko Kakutani
چکیده

In the study of quantum process algebras, researchers have introduced different notions of equivalence between quantum processes like bisimulation or barbed congruence. However, there are intuitively equivalent quantum processes that these notions do not regard as equivalent. In this paper, we introduce a notion of equivalence named observational equivalence into qCCS. Since quantum processes have both probabilistic and nondeterministic transitions, we introduce schedulers that solve nondeterministic choices and obtain probability distribution of quantum processes. By definition, restrictions of schedulers change observational equivalence. We propose some definitions of schedulers, and investigate the relation between the restrictions of schedulers and observational equivalence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Probabilistic Applied Pi-Calculus

We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve the nondeterministic choice among the probability distributions over target states. Notions of static and o...

متن کامل

Acronym : MEALS Deliverable no . : 1 . 3 / 2 Title of Deliverable : Probabilistic Bisimulation for Realistic Schedulers

Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It has gained some popularity as the coarsest behavioral equivalence enjoying valuable properties like preservation of trace distribution equivalence and compositionality. This holds in the classical context of arbitrary schedulers, but it has been argued that this class o...

متن کامل

Bisimulation for Demonic Schedulers

Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the process and collaborates with the attacker can allow him to distinguish two processes even though they are bisimilar. This phenomenon is related to the issue that bisimilarity is not preserved by refinement. As a sol...

متن کامل

Deciding equivalence-based properties using constraint solving

Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be defined (or cannot be naturally defined) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related pr...

متن کامل

Deciding equivalence-based properties using constraint solving1

Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be de ned (or cannot be naturally de ned) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014